Thread-based clock enabling in a multi-threaded processor

ABSTRACT

A method and apparatus for controlling power consumption in a multi-threaded processor. In one embodiment, the processor includes at least one logic unit for processing instructions. The logic unit includes a plurality of positions, wherein each of the plurality of positions corresponds to at least one instruction thread. Clock signals may be provided to the logic unit via a clock gating unit. The clock gating unit is configured to inhibit a clock signal from being provided to a corresponding one of the thread positions when no instruction thread is active for that position. The inhibiting of the clock signal for an inactive thread position may reduce power consumption by the processor.

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention relates to computer systems, and more particularly, to power conservation in computer system processors.

2. Description of the Related Art

Modern computer system processors consume a significant amount of power. It is not uncommon for the current consumption of a modern processor to exceed 100 amperes. Thus, such a processor may easily consume in excess of 100 watts of power even at system voltages as low as one volt. High power consumption can generate large amounts of heat which, if left unchecked, can adversely affect the operation of the processor and the computer system in which it is implemented. Thus, high power consumption and the potential for excess heat generation place significant engineering demands on the design of computer systems.

Various methods of power conservation are employed in computer systems. In many computers, various system components that are inactive may be powered down for the duration of their inactivity. In many computer systems, processors are only powered down when the entire system is in an idle state. Some processors may allow for the powering down of individual processor units (e.g., a bus interface unit) if the unit is inactive. However, the core of a processor typically cannot be powered down during system activity. The current consumed by the core of a processor may account for a large amount of its overall current consumption. Furthermore, activity in the core typically affects other units within the processor, and often times the entire computer system, and thus serves as a major driver of overall power consumption.

SUMMARY

A method and apparatus for controlling power consumption in a multi-threaded processor is disclosed. In one embodiment, the processor includes at least one logic unit for processing instructions. The logic unit includes a plurality of positions, wherein each of the plurality of positions corresponds to at least one instruction thread. Clock signals may be provided to the logic unit via a clock gating unit. The clock gating unit is configured to inhibit a clock signal from being provided to a corresponding one of the thread positions when no instruction thread is active for that position. The inhibiting of the clock signal for an inactive thread position may reduce power consumption by the processor.

In one embodiment, the processor is a pipelined processor having a plurality of logic units. In some logic units, the thread positions correspond to individual instruction threads, while in other logic units, the thread positions correspond to groups of instruction threads. For example, in one particular embodiment, a processor includes a fetch unit, an instruction pick unit, a decode unit, and a plurality of execution units. Each thread position in the fetch unit and the instruction pick unit corresponds to a single instruction thread, while each thread position in the decode unit and the thread position of each of the execution units corresponds to a group of instruction threads. Thus, for this particular embodiment, the clock may be provided (and thus inhibited) to the instruction fetch unit and instruction pick unit on a thread-by-thread basis. For the decode unit and the execution units in this embodiment, the clock may be inhibited when no instruction threads are active for the thread group corresponding to their respective thread positions.

The clock gating unit may be configured to receive an indication of whether or not a thread is active for a particular thread position in a logic unit, and may inhibit the clock signal accordingly. In one embodiment, the operating system may generate indications of whether or not threads are active for a given thread position.

BRIEF DESCRIPTION OF THE DRAWINGS

Other aspects of the invention will become apparent upon reading the following detailed description and upon reference to the accompanying drawings in which:

FIG. 1 is a block diagram illustrating one embodiment of a multithreaded processor;

FIG. 2 is a block diagram illustrating one embodiment of a processor core configured to perform fine-grained multithreading;

FIG. 3 a pipeline diagram illustrating the flow of instructions through one embodiment of a processor core;

FIG. 4 is a block diagram of a portion of one embodiment of a multi-threaded processor core having a clock gating unit;

FIG. 5 is a diagram illustrating one embodiment of a processor logic unit in which clock gating may be performed on a per-thread basis;

FIG. 6 is a diagram illustrating one embodiment of a processor logic unit in which clock gating may be performed on a per-thread group basis;

FIG. 7 is a flow diagram of one embodiment of a method for performing clock gating in a multi-threaded processor core; and

FIG. 8 is a block diagram illustrating one embodiment of a system including a multithreaded processor.

While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It should be understood, however, that the drawings and description thereto are not intended to limit the invention to the particular form disclosed, but, on the contrary, the invention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the present invention as defined by the appended claims.

DETAILED DESCRIPTION OF EMBODIMENTS

Overview of Multithreaded Processor Architecture

A block diagram illustrating one embodiment of a multithreaded processor 10 is shown in FIG. 1. In the illustrated embodiment, processor 10 includes a plurality of processor cores 100 a-h, which are also designated “core 0” though “core 7”. Each of cores 100 is coupled to an L2 cache 120 via a crossbar 110. L2 cache 120 is coupled to one or more memory interface(s) 130, which are coupled in turn to one or more banks of system memory (not shown). Additionally, crossbar 110 couples cores 100 to input/output (I/O) interface 140, which is in turn coupled to a peripheral interface 150 and a network interface 160. As described in greater detail below, I/O interface 140, peripheral interface 150 and network interface 160 may respectively couple processor 10 to boot and/or service devices, peripheral devices, and a network.

Cores 100 may be configured to execute instructions and to process data according to a particular instruction set architecture (ISA). In one embodiment, cores 100 may be configured to implement the SPARC® V9 ISA, although in other embodiments it is contemplated that any desired ISA may be employed, such as x86, PowerPC® or MIPS®, for example. In the illustrated embodiment, each of cores 100 may be configured to operate independently of the others, such that all cores 100 may execute in parallel. Additionally, as described below in conjunction with the descriptions of FIG. 2 and FIG. 3, in some embodiments each of cores 100 may be configured to execute multiple threads concurrently, where a given thread may include a set of instructions that may execute independently of instructions from another thread. (For example, an individual software process, such as an application, may consist of one or more threads that may be scheduled for execution by an operating system.) Such a core 100 may also be referred to as a multithreaded (MT) core. In one embodiment, each of cores 100 may be configured to concurrently execute instructions from eight threads, for a total of 64 threads concurrently executing across processor 10. However, in other embodiments it is contemplated that other numbers of cores 100 may be provided, and that cores 100 may concurrently process different numbers of threads.

Crossbar 110 may be configured to manage data flow between cores 100 and the shared L2 cache 120. In one embodiment, crossbar 110 may include logic (such as multiplexers or a switch fabric, for example) that allows any core 100 to access any bank of L2 cache 120, and that conversely allows data to be returned from any L2 bank to any core 100. Crossbar 110 may be configured to concurrently process data requests from cores 100 to L2 cache 120 as well as data responses from L2 cache 120 to cores 100. In some embodiments, crossbar 110 may include logic to queue data requests and/or responses, such that requests and responses may not block other activity while waiting for service. Additionally, in one embodiment crossbar 110 may be configured to arbitrate conflicts that may occur when multiple cores 100 attempt to access a single bank of L2 cache 120 or vice versa.

L2 cache 120 may be configured to cache instructions and data for use by cores 100. In the illustrated embodiment, L2 cache 120 may be organized into eight separately addressable banks that may each be independently accessed, such that in the absence of conflicts, each bank may concurrently return data to a respective core 100. In some embodiments, each individual bank may be implemented using set-associative or direct-mapped techniques. For example, in one embodiment, L2 cache 120 may be a 4 megabyte (MB) cache, where each 512 kilobyte (KB) bank is 16-way set associative with a 64-byte line size, although other cache sizes and geometries are possible and contemplated. L2 cache 120 may be implemented in some embodiments as a writeback cache in which written (dirty) data may not be written to system memory until a corresponding cache line is evicted.

In some embodiments, L2 cache 120 may implement queues for requests arriving from and results to be sent to crossbar 110. Additionally, in some embodiments L2 cache 120 may implement a fill buffer configured to store fill data arriving from memory interface 130, a writeback buffer configured to store dirty evicted data to be written to memory, and/or a miss buffer configured to store L2 cache accesses that cannot be processed as simple cache hits (e.g., L2 cache misses, cache accesses matching older misses, accesses such as atomic operations that may require multiple cache accesses, etc.). L2 cache 120 may variously be implemented as single-ported or multiported (i.e., capable of processing multiple concurrent read and/or write accesses). In either case, L2 cache 120 may implement arbitration logic to prioritize cache access among various cache read and write requestors.

Memory interface 130 may be configured to manage the transfer of data between L2 cache 120 and system memory, for example in response to L2 fill requests and data evictions. In some embodiments, multiple instances of memory interface 130 may be implemented, with each instance configured to control a respective bank of system memory. Memory interface 130 may be configured to interface to any suitable type of system memory, such as Fully Buffered Dual Inline Memory Module (FB-DIMM), Double Data Rate or Double Data Rate 2 Synchronous Dynamic Random Access Memory (DDR/DDR2 SDRAM), or Rambus® DRAM (RDRAM®), for example. In some embodiments, memory interface 130 may be configured to support interfacing to multiple different types of system memory.

In the illustrated embodiment, processor 10 may also be configured to receive data from sources other than system memory. I/O interface 140 may be configured to provide a central interface for such sources to exchange data with cores 100 and/or L2 cache 120 via crossbar 110. In some embodiments, I/O interface 140 may be configured to coordinate Direct Memory Access (DMA) transfers of data between network interface 160 or peripheral interface 150 and system memory via memory interface 130. In addition to coordinating access between crossbar 110 and other interface logic, in one embodiment I/O interface 140 may be configured to couple processor 10 to external boot and/or service devices. For example, initialization and startup of processor 10 may be controlled by an external device (such as, e.g., a Field Programmable Gate Array (FPGA)) that may be configured to provide an implementation- or system-specific sequence of boot instructions and data. Such a boot sequence may, for example, coordinate reset testing, initialization of peripheral devices and initial execution of processor 10, before the boot process proceeds to load data from a disk or network device. Additionally, in some embodiments such an external device may be configured to place processor 10 in a debug, diagnostic, or other type of service mode upon request.

Peripheral interface 150 may be configured to coordinate data transfer between processor 10 and one or more peripheral devices. Such peripheral devices may include, without limitation, storage devices (e.g., magnetic or optical media-based storage devices including hard drives, tape drives, CD drives, DVD drives, etc.), display devices (e.g., graphics subsystems), multimedia devices (e.g., audio processing subsystems), or any other suitable type of peripheral device. In one embodiment, peripheral interface 150 may implement one or more instances of an interface such as Peripheral Component Interface Express (PCI Express™), although it is contemplated that any suitable interface standard or combination of standards may be employed. For example, in some embodiments peripheral interface 150 may be configured to implement a version of Universal Serial Bus (USB) protocol or IEEE 1394 (Firewire®) protocol in addition to or instead of PCI Express™.

Network interface 160 may be configured to coordinate data transfer between processor 10 and one or more devices (e.g., other computer systems) coupled to processor 10 via a network. In one embodiment, network interface 160 may be configured to perform the data processing necessary to implement an Ethernet (IEEE 802.3) networking standard such as Gigabit Ethernet or 10-Gigabit Ethernet, for example, although it is contemplated that any suitable networking standard may be implemented. In some embodiments, network interface 160 may be configured to implement multiple discrete network interface ports.

Overview of Fine-Grained Multithreading Processor Core

As mentioned above, in one embodiment each of cores 100 may be configured for multithreaded execution. More specifically, in one embodiment each of cores 100 may be configured to perform fine-grained multithreading, in which each core may select instructions to execute from among a pool of instructions corresponding to multiple threads, such that instructions from different threads may be scheduled to execute adjacently. For example, in a pipelined embodiment of core 100 employing fine-grained multithreading, instructions from different threads may occupy adjacent pipeline stages, such that instructions from several threads may be in various stages of execution during a given core processing cycle.

One embodiment of core 100 configured to perform fine-grained multithreading is illustrated in FIG. 2. In the illustrated embodiment, core 100 includes an instruction fetch unit (IFU) 200 coupled to a memory management unit (MMU) 250, a crossbar interface 260, a trap logic unit (TLU) 270, and a plurality of execution units (EXU0, EXU1) 210 a-b. (Execution units 210 a-b may also be referred to generically as EXUs 210.) Each of execution units 210 a-b is coupled to both a floating point/graphics unit (FGU) 220 and a load store unit (LSU) 230. Each of the latter units is also coupled to send data back to each of execution units 210 a-b. Both FGU 220 and LSU 230 are coupled to a stream processing unit (SPU) 240. Additionally, LSU 230, SPU 240 and MMU 250 are coupled to crossbar interface 260, which is in turn coupled to crossbar 110 shown in FIG. 1.

Instruction fetch unit 200 may be configured to provide instructions to the rest of core 100 for execution. In the illustrated embodiment, IFU 200 includes a fetch unit 202, an instruction pick unit 206, and a decode unit 208. Fetch unit 202 further includes an instruction cache 204. In one embodiment, fetch unit 202 may include logic to maintain fetch addresses (e.g., derived from program counters) corresponding to each thread being executed by core 100, and to coordinate the retrieval of instructions from instruction cache 204 according to those fetch addresses. In some embodiments, instruction cache 202 may include fewer access ports than the number of threads executable on core 100, in which case fetch unit 202 may implement arbitration logic configured to select one or more threads for instruction fetch during a given execution cycle. For example, fetch unit 202 may implement a least-recently-fetched algorithm to select a thread to fetch. Fetch unit 202 may also implement logic to handle instruction cache misses and translation of virtual instruction fetch addresses to physical addresses (e.g., fetch unit 202 may include an Instruction Translation Lookaside Buffer (ITLB)). Additionally, in some embodiments fetch unit 202 may include logic to predict branch outcomes and/or fetch target addresses, such as a Branch History Table (BHT), Branch Target Buffer (BTB), or other suitable structure, for example.

In one embodiment, fetch unit 202 may be configured to maintain a pool of fetched, ready-for-issue instructions drawn from among each of the threads being executed by core 100. For example, fetch unit 202 may implement a respective instruction buffer corresponding to each thread in which several recently-fetched instructions from the corresponding thread may be stored. In one embodiment, instruction pick unit 206 may be configured to select one or more instructions to be decoded and issued to execution units 210. In the illustrated embodiment, the threads fetched by fetch unit 202 may be divided into two thread groups denoted TG0 and TG1 (for example, if core 100 implements eight threads, each of TG0 and TG1 may include four threads).

Pick unit 206, in the illustrated embodiment, may be configured to attempt to select one instruction to schedule for execution from each of TG0 and TG1, such that two instructions may be selected for execution during a given execution cycle. For example, pick unit 206 may employ a least-recently-picked (LRP) algorithm in which the least recently picked thread within a given thread group that is ready for execution is selected. It is noted that in one embodiment, thread fetching as performed by fetch unit 202 and instruction selection as performed by pick unit 206 may be largely independent of one another. In some embodiments, pick unit 206 may schedule instructions before all factors affecting instruction scheduling are known (e.g., instruction dependencies, implementation-specific resource hazards, etc.), in which case a picked instruction may be canceled at a later execution stage. In other embodiments, it is contemplated that other instruction selection algorithms may be employed, including algorithms that take additional instruction scheduling factors into account. Further, it is contemplated that in some embodiments, pick unit 206 may be configured to select more than two instructions for execution in a given execution cycle, or may select instructions from all threads rather than specific groups of threads. Additionally, in one embodiment pick unit 206 may be configured to identify source operand dependencies that a given picked instruction may have on a previously issued instruction, and may configure other logic to appropriately select source operands (e.g., from a register file, or from a previous execution cycle via bypass logic).

Decode unit 208 may be configured to further prepare instructions selected by pick unit 206 for execution. In the illustrated embodiment, decode unit 208 may be configured to identify the specific type of a given instruction, such as whether the instruction is an integer, floating point, load/store, or other type of instruction, as well as to identify operands required by the given instruction. Additionally, in one embodiment decode unit 208 may be configured to detect and respond to scheduling hazards not detected during operation of pick unit 206. For example, in the illustrated embodiment, only one load store unit 230 is provided. Consequently, if two load/store-type instructions were picked for execution, decode unit 208 may be configured to cancel or stall one of those instructions and allow the other to be issued. In such an embodiment, decode unit 208 may employ an arbitration algorithm to determine which instruction to issue without favoring a particular thread or thread group. Numerous other types of scheduling and resource hazards detectable by decode unit 208 are possible and contemplated.

In some embodiments, instructions from a given thread may be speculatively issued from decode unit 208 for execution. For example, a given instruction from a certain thread may fall in the shadow of a conditional branch instruction from that same thread that was predicted to be taken or not-taken, or a load instruction from that same thread that was predicted to hit in data cache 235, but for which the actual outcome has not yet been determined. In such embodiments, after receiving notice of a misspeculation such as a branch misprediction or a load miss, IFU 200 may be configured to cancel misspeculated instructions from a given thread as well as issued instructions from the given thread that are dependent on or subsequent to the misspeculated instruction, and to redirect instruction fetch appropriately.

Execution units 210 a-b may be configured to execute and provide results for certain types of instructions issued from IFU 200. In one embodiment, each of EXUs 210 may be similarly or identically configured to execute certain integer-type instructions defined in the implemented ISA, such as arithmetic, logical, and shift instructions. In the illustrated embodiment, EXU0 210 a may be configured to execute integer instructions issued from TG0, while EXU1 210 b may be configured to execute integer instructions issued from TG1. Further, each of EXUs 210 may include an integer register file configured to store register state information for all threads in its respective thread group. For example, if core 100 implements eight threads 0-7 where threads 0-3 are bound to TG0 and threads 4-7 are bound to TG1, EXU0 210 a may store integer register state for each of threads 0-3 while EXU1 210 b may store integer register state for each of threads 4-7. It is contemplated that in some embodiments, core 100 may include more or fewer than two EXUs 210, and EXUs 210 may or may not be symmetric in functionality. Also, in some embodiments EXUs 210 may not be bound to specific thread groups or may be differently bound than just described. Finally, in the illustrated embodiment instructions destined for FGU 220 or LSU 230 pass through one of EXUs 210. However, in alternative embodiments it is contemplated that such instructions may be issued directly from IFU 200 to their respective units without passing through one of EXUs 210.

Floating point/graphics unit 220 may be configured to execute and provide results for certain floating-point and graphics-oriented instructions defined in the implemented ISA. For example, in one embodiment FGU 220 may implement single- and double-precision floating-point arithmetic instructions compliant with the IEEE 754 floating-point standard, such as add, subtract, multiply, divide, and certain transcendental functions. Also, in one embodiment FGU 220 may implement partitioned-arithmetic and graphics-oriented instructions defined by a version of the SPARC® Visual Instruction Set (VIS™) architecture, such as VIS™ 2.0. Additionally, in one embodiment FGU 220 may implement certain integer instructions such as integer multiply, divide, and population count instructions, and may be configured to perform multiplication operations on behalf of stream processing unit 240. Depending on the implementation of FGU 220, some instructions (e.g., some transcendental or extended-precision instructions) or instruction operand or result scenarios (e.g., certain denormal operands or expected results) may be trapped and handled or emulated by software.

In the illustrated embodiment, FGU 220 may be configured to store floating-point register state information for each thread in a floating-point register file. In one embodiment, FGU 220 may implement separate execution pipelines for floating point add/multiply, divide/square root, and graphics operations, while in other embodiments the instructions implemented by FGU 220 may be differently partitioned. In various embodiments, instructions implemented by FGU 220 may be fully pipelined (i.e., FGU 220 may be capable of starting one new instruction per execution cycle), partially pipelined, or may block issue until complete, depending on the instruction type. For example, in one embodiment floating-point add operations may be fully pipelined, while floating-point divide operations may block other divide/square root operations until completed.

Load store unit 230 may be configured to process data memory references, such as integer and floating-point load and store instructions as well as memory requests that may originate from stream processing unit 240. In some embodiments, LSU 230 may also be configured to assist in the processing of instruction cache 204 misses originating from IFU 200. LSU 230 may include a data cache 235 as well as logic configured to detect cache misses and to responsively request data from L2 cache 120 via crossbar interface 260. In one embodiment, data cache 235 may be configured as a write-through cache in which all stores are written to L2 cache 120 regardless of whether they hit in data cache 235; in some such embodiments, stores that miss in data cache 235 may cause an entry corresponding to the store data to be allocated within the cache. In other embodiments, data cache 235 may be implemented as a write-back cache.

In one embodiment, LSU 230 may include a miss queue configured to store records of pending memory accesses that have missed in data cache 235 such that additional memory accesses targeting memory addresses for which a miss is pending may not generate additional L2 cache request traffic. In the illustrated embodiment, address generation for a load/store instruction may be performed by one of EXUs 210. Depending on the addressing mode specified by the instruction, one of EXUs 210 may perform arithmetic (such as adding an index value to a base value, for example) to yield the desired address. Additionally, in some embodiments LSU 230 may include logic configured to translate virtual data addresses generated by EXUs 210 to physical addresses, such as a Data Translation Lookaside Buffer (DTLB).

Stream processing unit 240 may be configured to implement one or more specific data processing algorithms in hardware. For example, SPU 240 may include logic configured to support encryption/decryption algorithms such as Advanced Encryption Standard (AES), Data Encryption Standard/Triple Data Encryption Standard (DES/3DES), or Ron's Code #4 (RC4). SPU 240 may also include logic to implement hash or checksum algorithms such as Secure Hash Algorithm (SHA-1, SHA-256), Message Digest 5 (MD5), or Cyclic Redundancy Checksum (CRC). SPU 240 may also be configured to implement modular arithmetic such as modular multiplication, reduction and exponentiation. In one embodiment, SPU 240 may be configured to utilize the multiply array included in FGU 220 for modular multiplication. In various embodiments, SPU 240 may implement several of the aforementioned algorithms as well as other algorithms not specifically described.

SPU 240 may be configured to execute as a coprocessor independent of integer or floating-point instruction execution. For example, in one embodiment SPU 240 may be configured to receive operations and operands via control registers accessible via software; in the illustrated embodiment SPU 240 may access such control registers via LSU 230. In another embodiment SPU 240 may receive operations and operands decoded and issued from the instruction stream by IFU 200. In some embodiments, SPU 240 may be configured to freely schedule operations across its various algorithmic subunits independent of other functional unit activity. Additionally, SPU 240 may be configured to generate memory load and store activity. In the illustrated embodiment, SPU 240 may interact directly with crossbar interface 260 for such memory activity, while in other embodiments SPU 240 may coordinate memory activity through LSU 230. In one embodiment, software may poll SPU 240 through one or more control registers to determine result status and to retrieve ready results, for example by accessing additional control registers. In other embodiments, FGU 220, LSU 230 or other logic may be configured to poll SPU 240 at intervals to determine whether it has ready results to write back. In still other embodiments, SPU 240 may be configured to generate a trap when a result is ready, to allow software to coordinate result retrieval and processing.

As previously described, instruction and data memory accesses may involve translating virtual addresses to physical addresses. In one embodiment, such translation may occur on a page level of granularity, where a certain number of address bits comprise an offset into a given page of addresses, and the remaining address bits comprise a page number. For example, in an embodiment employing 4 MB pages, a 64-bit virtual address and a 40-bit physical address, 22 address bits (corresponding to 4 MB of address space, and typically the least significant address bits) may constitute the page offset. The remaining 42 bits of the virtual address may correspond to the virtual page number of that address, and the remaining 18 bits of the physical address may correspond to the physical page number of that address. In such an embodiment, virtual to physical address translation may occur by mapping a virtual page number to a particular physical page number, leaving the page offset unmodified.

Such translation mappings may be stored in an ITLB or a DTLB for rapid translation of virtual addresses during lookup of instruction cache 204 or data cache 235. In the event no translation for a given virtual page number is found in the appropriate TLB, memory management unit 250 may be configured to provide a translation. In one embodiment, MMU 250 may be configured to manage one or more translation tables stored in system memory and to traverse such tables (which in some embodiments may be hierarchically organized) in response to a request for an address translation, such as from an ITLB or DTLB miss. (Such a traversal may also be referred to as a page table walk.) In some embodiments, if MMU 250 is unable to derive a valid address translation, for example if one of the memory pages including a necessary page table is not resident in physical memory (i.e., a page miss), MMU 250 may be configured to generate a trap to allow a memory management software routine to handle the translation. It is contemplated that in various embodiments, any desirable page size may be employed. Further, in some embodiments multiple page sizes may be concurrently supported.

A number of functional units in the illustrated embodiment of core 100 may be configured to generate off-core memory or I/O requests. For example, IFU 200 or LSU 230 may generate access requests to L2 cache 120 in response to their respective cache misses. SPU 240 may be configured to generate its own load and store requests independent of LSU 230, and MMU 250 may be configured to generate memory requests while executing a page table walk. Other types of off-core access requests are possible and contemplated. In the illustrated embodiment, crossbar interface 260 may be configured to provide a centralized interface to the port of crossbar 110 associated with a particular core 100, on behalf of the various functional units that may generate accesses that traverse crossbar 110. In one embodiment, crossbar interface 260 may be configured to maintain queues of pending crossbar requests and to arbitrate among pending requests to determine which request or requests may be conveyed to crossbar 110 during a given execution cycle. For example, crossbar interface 260 may implement a least-recently-used or other algorithm to arbitrate among crossbar requestors. In one embodiment, crossbar interface 260 may also be configured to receive data returned via crossbar 110, such as from L2 cache 120 or I/O interface 140, and to direct such data to the appropriate functional unit (e.g., data cache 235 for a data cache fill due to miss). In other embodiments, data returning from crossbar 110 may be processed externally to crossbar interface 260.

During the course of operation of some embodiments of core 100, exceptional events may occur. For example, an instruction from a given thread that is picked for execution by pick unit 206 may be not be a valid instruction for the ISA implemented by core 100 (e.g., the instruction may have an illegal opcode), a floating-point instruction may produce a result that requires further processing in software, MMU 250 may not be able to complete a page table walk due to a page miss, a hardware error (such as uncorrectable data corruption in a cache or register file) may be detected, or any of numerous other possible architecturally-defined or implementation-specific exceptional events may occur. In one embodiment, trap logic unit 270 may be configured to manage the handling of such events. For example, TLU 270 may be configured to receive notification of an exceptional event occurring during execution of a particular thread, and to cause execution control of that thread to vector to a supervisor-mode software handler (i.e., a trap handler) corresponding to the detected event. Such handlers may include, for example, an illegal opcode trap handler configured to return an error status indication to an application associated with the trapping thread and possibly terminate the application, a floating-point trap handler configured to fix up an inexact result, etc.

In one embodiment, TLU 270 may be configured to flush all instructions from the trapping thread from any stage of processing within core 100, without disrupting the execution of other, non-trapping threads. In some embodiments, when a specific instruction from a given thread causes a trap (as opposed to a trap-causing condition independent of instruction execution, such as a hardware interrupt request), TLU 270 may implement such traps as precise traps. That is, TLU 270 may ensure that all instructions from the given thread that occur before the trapping instruction (in program order) complete and update architectural state, while no instructions from the given thread that occur after the trapping instruction (in program) order complete or update architectural state.

Exemplary Core Pipeline Diagram

In the illustrated embodiment, core 100 may be configured for pipelined execution, in which processing of new instructions may begin before older instructions have completed, such that multiple instructions from various threads may be in various stages of processing during a given core execution cycle. A pipeline diagram illustrating the flow of integer instructions through one embodiment of core 100 is shown in FIG. 3. In the illustrated embodiment, execution of integer instructions is divided into eight stages, denoted Fetch (F), Cache (C), Pick (P), Decode (D), Execute (E), Memory (M), Bypass (B), and Writeback (W). In other embodiments, it is contemplated that different numbers of pipe stages corresponding to different types of functionality may be employed. It is further contemplated that other pipelines of different structure and depth may be implemented for integer or other instructions. For example, floating-point instructions may execute in a longer pipeline than integer instructions.

The first four stages of the illustrated integer pipeline may generally correspond to the functioning of IFU 200. In one embodiment, during the Fetch stage, one or more threads to fetch may be selected, and instruction cache 204 may be accessed for the selected thread. During the Cache stage, fetch unit 202 may determine whether the access of the previous cycle hit or missed the cache. If the access hit, the instructions read from the cache may be stored in instruction buffers. During the Pick stage, pick unit 206 may be configured in one embodiment to select at most two instructions to issue, one for each thread group as described above. Source dependencies of the selected instructions on previously issued instructions may also be detected during the Pick stage. During the Decode stage, decode unit 208 may be configured to decode the selected instructions and to determine whether resource hazards exist as described above. For integer operations, data operands may also be selected during the Decode stage. For example, operands may be retrieved from an integer register file, or bypass logic may be configured to bypass operands from another pipe stage.

During the Execute stage, one or both of execution units 210 may be active to compute an instruction result. If an instruction in the integer execution pipeline is not a load or store instruction, in the illustrated embodiment it may be idle during the Memory and Bypass stages before its result is committed (i.e., written back to the integer register file) in the Writeback stage. A load or store instruction may have its address calculated by one of execution units 210 during the Execute stage. During the Memory stage of a load instruction, data cache 235 may be accessed, while during the Bypass stage, LSU 230 may determine whether a data cache hit or miss occurred. In the hit case, data may be forwarded to the appropriate execution unit 210 (e.g., dependent on the thread group of the load instruction) to be committed during the Writeback stage. In one embodiment, store instructions and load instructions that miss data cache 235 may execute with different pipeline timing than shown in FIG. 3.

In the illustrated embodiment, integer instructions are depicted as executing back-to-back in the pipeline without stalls. In execution cycles 0 through 7, instructions from threads 0, 3, 6, 2, 7, 5, 1 and 4 enter the Fetch stage, respectively, though in other embodiments, instructions may issue from various threads in a different order according to the operation of pick unit 206. In some instances, other instructions issued prior to execution cycle 0 may also be in the pipeline. Additionally, in some embodiments, two different instructions from the same or different threads may execute during the same pipeline stage. For example, in the illustrated embodiment of core 100, one integer instruction may be issued to each of execution units 210 in a single cycle.

By execution cycle 7, it is noted that each stage of the pipeline holds an instruction from a different thread in a different stage of execution, in contrast to conventional processor implementations that typically require a pipeline flush when switching between threads or processes. In some embodiments, flushes and stalls due to resource conflicts or other scheduling hazards may cause some pipeline stages to have no instruction during a given cycle. However, in the fine-grained multithreaded processor implementation employed by the illustrated embodiment of core 100, such flushes and stalls may be directed to a single thread in the pipeline, leaving other threads undisturbed. Additionally, even if one thread being processed by core 100 stalls for a significant length of time (for example, due to an L2 cache miss), instructions from another thread may be readily selected for issue, thus increasing overall thread processing throughput.

Power Management Using Clock Gating

Turning now to FIG. 4, a block diagram of a portion of one embodiment of a multi-threaded processor core having a clock gating unit. In the embodiment shown, core 100 is a multi-threaded, pipelined processor core having a plurality of logic units. These logic units include fetch unit 202, instruction pick unit 206, decode unit 208, execution logic including execution units 210 a and 210 b, and trap logic unit 270. Additional logic may also be present, as shown in FIG. 2.

Clock gate unit 280 is coupled to receive one or more input clock signals from a source external to processor core 100. Clock gate unit 280 may be centralized as shown in FIG. 4 or it may be distributed. In a distributed embodiment, each logic unit would have one or more copies of the clock gating logic to generate the actual clocks used by the logic unit. In turn, each of the logic units shown in FIG. 2 is coupled to receive clock signals from clock gate unit 280. Clock signals conveyed from clock gate unit 280 to the various logic units may be selectively inhibited to conserve power when all or a portion of a logic unit is not in use.

Each logic unit is coupled to receive multiple instances of a clock signal. The specific number of instances of the clock signal received by a particular logic unit may be based on the number of instruction threads or thread groups that the logic unit may process in a given cycle. Some logic units may include separate positions for each thread, and thus may receive a separate instance of the clock signal for each thread position. Other logic units may include separate positions for a group of threads, and thus receive a separate clock signal for each thread group. In the embodiment shown, fetch unit 202 and instruction pick unit 206 are each coupled to receive one instance of the clock signal for each instruction thread that can be processed within. Decode unit 208, trap logic unit 270, and the execution logic (which includes execution units 210 a and 210 b) are each coupled to receive one instance of the clock signal for each group of instruction threads that may be processed within.

Clock gate unit 280 is coupled to receive one or more thread activity inputs, which convey information about which thread or thread group positions in each of the logic units are processing active instruction threads. If a given thread position is determined to be inactive (no active instruction thread being processed in that position), clock gate unit 280 may gate the associated instances of the clock signal, thereby preventing it from being provided to that thread position. Thread activity inputs may come from various sources, such as applications software or operating system software. In some embodiments, monitoring logic (not shown here) may be present in the processor, including within the processor core, to monitor each thread/thread group position of the various logic units for the presence of active threads. In such embodiments, the monitoring logic may provide some or all of the thread activity inputs to clock gate unit 280.

Moving now to FIG. 5, a diagram illustrating one embodiment of a processor logic unit in which clock gating may be performed on a per-thread basis is shown. Logic unit 205 may be one of several logic units configured for processing instruction threads individually in the core of a multi-threaded processor. Using the embodiment of core 100 in FIG. 4 as an example, implementations of logic unit 205 may include the instruction fetch unit 202 and the instruction pick unit 206. Embodiments wherein other logic units in a processor core are configured to process instruction threads individually are possible and contemplated.

Each thread position in logic unit 205 (e.g., Thread0 logic, Thread1 logic, etc.) is coupled to receive a clock signal independently of the other thread positions. The clock signal is received from a clock gate unit 280 (as discussed above in reference to FIG. 4). Thus, the clock signal for each thread position may be inhibited independently by the clock gate unit independent of the status of the clock signal provided to the other thread positions. In this particular embodiment of logic unit 205, there are 8 thread positions, and thus, if only one thread is active, clock gate unit 280 may inhibit the clock signal for the other 7 thread positions, resulting in a power savings that is approximately ⅞ of the peak power that logic unit 205 may consume. Inhibiting the clock to any one thread position may result in a power savings of approximately ⅛ of the peak power consumed by logic unit 205.

It should be noted that while the embodiment of logic unit 205 shown here is configured to simultaneously process up to 8 different instruction threads, embodiments configured for processing a greater or lesser number of instruction threads are possible and contemplated.

FIG. 6 is a diagram illustrating one embodiment of a processor logic unit in which clock gating may be performed on a per-thread group basis. In the embodiment shown, logic unit 209 is configured to process two different thread groups (i.e. groups of instruction threads). Similar to logic unit 205 discussed above, logic unit 209 may also be a one of several logic units configured for processing instruction threads in the core of a multi-threaded processor. However, logic unit 209 (unlike logic unit 205) processes instruction threads in groups instead of individually. Using the embodiment of core 100 in FIG. 4 as an example, implementations of logic unit 209 may include trap logic unit 270, decode unit 208, and the execution logic (which includes execution units 201 a and 210 b).

In the embodiment shown, logic unit 209 is configured to independently process two instruction thread groups (one in thread group logic 0 and one in thread group logic 1). Embodiments configured to process a greater number of thread groups are possible and contemplated. Thus, each thread group position may receive a clock signal independently of the other thread group position (or positions in embodiments configured for processing more than two thread groups). The number of threads processed by each position is dependent on the specific implementation. For example, if the embodiment shown in FIG. 6 is configured to process a total of 8 threads in two separate groups, then each thread group position may process up to 4 threads simultaneously.

Logic unit 209 is monitored for the presence of active threads in a similar manner to logic unit 205. If there are no active threads present in a thread group position, then clock gate unit 280 may inhibit a clock signal from being provided to logic unit 209, thereby reducing its power consumption. Thus, in the embodiment shown, inhibiting the clock signal to one of the thread group positions may result in a savings of approximately one half the peak power consumption of logic unit 209. In embodiments having more than two thread group positions, the savings of power consumption is approximately proportional to a given thread group positions overall contribution to power consumption.

FIG. 7 is a flow diagram of one embodiment of a method for performing clock gating in a multi-threaded processor core. In method 700, all thread positions in various logic units of a processor are monitored for the presence or absence of active instruction threads (702). In some of the logic units, each thread position may correspond to a single instruction thread. In this type of logic unit, each thread position may be coupled to receive a clock signal independent of the other thread positions. If the monitoring determines that no active instruction thread is present for a given thread position (704), then the clock signal provided to that position may be inhibited (706) in order to conserve power.

In other logic units of the processor core, thread positions may correspond to a group of instruction threads. Thus, if it is determined no threads are active in a thread group that corresponds to the thread group position (708), the clock signal received by that thread group position may be inhibited (710).

After a clock signal has been inhibited to either a thread position or a thread group position, monitoring continues (711) in order to detect the presence of any newly active instruction threads in that position. If an instruction thread becomes active within the thread/thread group position (712), the inhibiting of the clock to that position may cease and thereby allow a clock signal to be provided (714). The method may then return to monitoring for the absence of active threads in a thread or thread group position (702).

Exemplary System Embodiment

As described above, in some embodiments processor 10 of FIG. 1 may be configured to interface with a number of external devices. One embodiment of a system including processor 10 is illustrated in FIG. 8. In the illustrated embodiment, system 800 includes an instance of processor 10 coupled to a system memory 810, a peripheral storage device 820 and a boot device 830. System 800 is coupled to a network 840, which is in turn coupled to another computer system 850. In some embodiments, system 800 may include more than one instance of the devices shown, such as more than one processor 10, for example. In various embodiments, system 800 may be configured as a rack-mountable server system, a standalone system, or in any other suitable form factor. In some embodiments, system 800 may be configured as a client system rather than a server system.

In various embodiments, system memory 810 may comprise any suitable type of system memory as described above, such as FB-DIMM, DDR/DDR2 SDRAM, or RDRAM®, for example. System memory 810 may include multiple discrete banks of memory controlled by discrete memory interfaces in embodiments of processor 10 configured to provide multiple memory interfaces 130. Also, in some embodiments system memory 810 may include multiple different types of memory.

Peripheral storage device 820, in various embodiments, may include support for magnetic, optical, or solid-state storage media such as hard drives, optical disks, nonvolatile RAM devices, etc. In some embodiments, peripheral storage device 820 may include more complex storage devices such as disk arrays or storage area networks (SANs), which may be coupled to processor 10 via a standard Small Computer System Interface (SCSI), a Fibre Channel interface, a Firewire® (IEEE 1394) interface, or another suitable interface. Additionally, it is contemplated that in other embodiments, any other suitable peripheral devices may be coupled to processor 10, such as multimedia devices, graphics/display devices, standard input/output devices, etc.

As described previously, in one embodiment boot device 830 may include a device such as an FPGA or ASIC configured to coordinate initialization and boot of processor 10, such as from a power-on reset state. Additionally, in some embodiments boot device 830 may include a secondary computer system configured to allow access to administrative functions such as debug or test modes of processor 10.

Network 840 may include any suitable devices, media and/or protocol for interconnecting computer systems, such as wired or wireless Ethernet, for example. In various embodiments, network 840 may include local area networks (LANs), wide area networks (WANs), telecommunication networks, or other suitable types of networks. In some embodiments, computer system 850 may be similar to or identical in configuration to illustrated system 800, whereas in other embodiments, computer system 850 may be substantially differently configured. For example, computer system 850 may be a server system, a processor-based client system, a stateless “thin” client system, a mobile device, etc.

While the present invention has been described with reference to particular embodiments, it will be understood that the embodiments are illustrative and that the invention scope is not so limited. Any variations, modifications, additions, and improvements to the embodiments described are possible. These variations, modifications, additions, and improvements may fall within the scope of the inventions as detailed within the following claims. 

1. A processor, comprising: at least one logic unit, wherein the logic unit is included within a pipeline, having a plurality of thread positions, wherein each of the plurality of thread positions is configured to process at least one instruction thread different from the other instruction threads of the plurality of thread positions during a given clock cycle; and a clock gating unit, wherein the clock gating unit is configured to inhibit a clock signal from being provided to a corresponding one of the plurality of thread positions when no instruction thread is active for the one of the plurality of thread positions.
 2. The processor as recited in claim 1, wherein the at least one logic unit is an instruction fetch unit, and wherein each of the plurality of thread positions corresponds to a single instruction thread.
 3. The processor as recited in claim 1, wherein the at least one logic unit is an instruction pick unit, and wherein each of a plurality of thread positions corresponds to a single instruction thread.
 4. The processor as recited in claim 1, wherein each of the plurality of thread positions corresponds to a group of instruction threads.
 5. The processor as recited in claim 4, wherein the at least one logic unit is a decode unit, and wherein a first one of the plurality of thread positions corresponds to a first group of instruction threads and a second one of the plurality of thread positions corresponds to a second group of instruction threads.
 6. The processor as recited in claim 1, wherein the at least one logic unit is execution logic including a first execution unit and a second execution unit, wherein the first execution unit includes a first one of the plurality of thread positions corresponding to a first group of instruction threads, and wherein the second execution unit includes a second one of the plurality of thread positions corresponding to a second group of instruction threads.
 7. The processor as recited in claim 4, wherein the at least one logic unit is a trap logic unit.
 8. The processor as recited in claim 1, wherein the clock gating unit is configured to receive an indication of which of the plurality of thread positions include an active instruction thread.
 9. The processor as recited in claim 8, wherein the indication is generated by an operating system.
 10. A method for controlling power consumption in a processor, the method comprising: monitoring each of a plurality of thread positions, wherein each of the plurality of thread positions is configured to process at least one instruction thread different from the other instruction threads of the plurality of thread positions during a given clock cycle, in a logic unit for the presence of an active instruction thread, wherein the logic unit is included within said pipeline; and inhibiting a clock signal from being provided to one of the plurality of thread positions if no active instruction thread is present for the one of the plurality of thread positions.
 11. The method as recited in claim 10, wherein the logic unit is an instruction fetch unit, and wherein each of the plurality of thread positions corresponds to a single instruction thread.
 12. The method as recited in claim 10, wherein the logic unit is an instruction pick unit, and wherein each of the plurality of thread positions corresponds to a single instruction thread.
 13. The method as recited in claim 10, wherein each of the plurality of thread positions corresponds to a group of instruction threads.
 14. The method as recited in claim 13, wherein the at least one logic unit is a decode unit, and wherein a first one of the plurality of thread positions corresponds to a first group of instruction threads and a second one of the plurality of thread positions corresponds to a second group of instruction threads.
 15. The method as recited in claim 10, wherein the at least one logic unit is execution logic including a first execution unit and a second execution unit, wherein the first execution unit includes a first one of the plurality of thread positions corresponding to a first group of instruction threads, and wherein the second execution unit includes a second one of the plurality of thread positions corresponding to a second group of instruction threads.
 16. The method as recited in claim 13, wherein the at least one logic unit is a trap logic unit.
 17. The method as recited in claim 10, wherein the clock gating unit is configured to receive an indication of which of the plurality of thread positions include an active instruction thread.
 18. The method as recited in claim 17, wherein the indication is generated by an operating system. 